Decomposing Cavities in Digital Volumes into Products of Cycles

نویسندگان

  • Ainhoa Berciano
  • Helena Molina-Abril
  • Ana Pacheco
  • Pawel Pilarczyk
  • Pedro Real Jurado
چکیده

The homology of binary 3–dimensional digital images (digital volumes) provides concise algebraic description of their topology in terms of connected components, tunnels and cavities. Homology generators corresponding to these features are represented by nontrivial 0– cycles, 1–cycles and 2–cycles, respectively. In the framework of cubical representation of digital volumes with the topology that corresponds to the 26–connectivity between voxels, we introduce a method for algorithmic computation of a coproduct operation that can be used to decompose 2–cycles into products of 1–cycles (possibly trivial). This coproduct provides means of classifying different kinds of cavities; in particular, it allows to distinguish certain homotopically non-equivalent spaces that have isomorphic homology. We define this coproduct at the level of a cubical complex built directly upon voxels of the digital image, and we construct it by means of the classical Alexander-Whitney map on a simplicial subdivision of faces of the voxels.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Statistical geometry of particle packings. I. Algorithm for exact determination of connectivity, volume, and surface areas of void space in monodisperse and polydisperse sphere packings

Packings of spheres serve as useful models of the geometry of many physical systems; in particular, the description of the void region in such packings ~the region not occupied by the spheres! is crucial in many studies. The void region is, in general, composed of disconnected cavities. We present an algorithm for decomposing void space into cavities and determining the exact volumes and surfac...

متن کامل

Decomposing Complete Equipartite Graphs into Short Odd Cycles

In this paper we examine the problem of decomposing the lexicographic product of a cycle with an empty graph into cycles of uniform length. We determine necessary and sufficient conditions for a solution to this problem when the cycles are of odd length. We apply this result to find necessary and sufficient conditions to decompose a complete equipartite graph into cycles of uniform length, in t...

متن کامل

Microleakage of cervical cavities prepared by an Er:YAG laser or a high-speed handpiece, after restoration using resin composite

Objectives: The purpose of this in vitro study was to evaluate the microleakage of cervical cavities prepared by Er:YAG laser or high-speed hand piece and bur. Methods: This in vitro experimental study was performed on 40 sound permanent third molar teeth randomly assigned into two equal groups (n=20). In the first group, high-speed hand piece and bur and in the second group Er:YAG la...

متن کامل

بررسی اثر سیکل مکانیکی بر ریزنشت سه گلاس آینومر ترمیمی در حفرات کلاس پنج

  Background and Aims: Microleakage is an important problem with direct restorations and familiarity with contributing factors is of utmost importance. The aim of this study was to evaluate the microleakage of three glass ionomer restorations in class V cavities.   Materials and Methods: In this in vitro study, class V cavity preparations were made on the buccal and lingual/ palatal surfaces of...

متن کامل

Microleakage assessment of one- and two-step self-etch adhesive systems with ‎the low shrinkage composites

BACKGROUND AND AIM: Different studies evaluating one-step self-etch (SE) adhesive systems show contradictory findings, so the aim of this study was to compare the microleakage of one-step SE adhesive systems and CLEARFIL SE BOND (that serves as the “gold-standard” SE adhesive) with low shrinkage composites. METHODS: In this in vitro study, Class V cavities with the occlusal margin in enamel and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009